Efficient Linear Array for Multiplication in GF (2) Using a Normal Basis for Elliptic Curve Cryptography
نویسندگان
چکیده
We present a new sequential normal basis multiplier over GF (2). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to that of Reyhani-Masoleh and Hasan, which is the lowest complexity normal basis multiplier of the same kinds. On the other hand, the critical path delay of our multiplier is same to that of Agnew et al. Therefore it is supposed to have a shorter or the same critical path delay to that of Reyhani-Masoleh and Hasan. Moreover our method of using a Gaussian normal basis makes it easy to find a basic multiplication table of normal elements. So one can easily construct a circuit array for large finite fields, GF (2) where m = 163, 233, 283, 409, 571, i.e. the five recommended fields by NIST for elliptic curve cryptography.
منابع مشابه
Efficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography
We present a new sequential normal basis multiplier over GF (2). The gate complexity of our multiplier is significantly reduced from that of Agnew et al. and is comparable to that of Reyhani-Masoleh and Hasan, which is the lowest complexity normal basis multiplier of the same kinds. On the other hand, the critical path delay of our multiplier is same to that of Agnew et al. Therefore it is supp...
متن کاملDesign and Implementation of Ec Based Cryptosystem on Fpga
As computing and communication devices are equipped with increasingly versatile wireless connection capabilities, the demand for security increases. Cryptography provides a method for securing and authenticating the transmission of information over the insecure channels. Elliptic Curve [EC] Cryptography is a public key cryptography which replaces RSA because of its increased security with lesse...
متن کاملAn area/performance trade-off analysis of a GF(2) multiplier architecture for elliptic curve cryptography
A hardware architecture for GF(2 m) multiplication and its evaluation in a hardware architecture for elliptic curve scalar multiplication is presented. The architecture is a parameter-izable digit-serial implementation for any field order m. Area/performance trade-off results of the hardware implementation of the multiplier in an FPGA are presented and discussed. Finite fields like the binary G...
متن کاملAn FPGA implementation of elliptic curve cryptography for future secure web transaction
Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. So it would be more attractive to implement this unit using hardware than using software. In this pa...
متن کاملImplementation of the Optimal Normal Basis Operations in Elliptic Curve Cryptography in VIVA
The aim of this project is to implement the operations of Elliptic Curve Cryptography built over GF(2) represented with optimal normal basis in VIVA System. These operations include multiplication, inverse, point addition, point doubling and scalar multiplication. The target device is Xilinx 4062 embedded in the FAI board of HAL-15 hypercomputer. The synthesis results using VIVA and VHDL are co...
متن کامل